National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Hledání APN permutací ve známých APN funkcích
Pavlů, Jiří ; Göloglu, Faruk (advisor) ; Drápal, Aleš (referee)
In the thesis a new way of checking whether a function is CCZ-equivalent to a permutation is given. The results for known families of almost perfect nonlinear (APN) functions are presented for functions defined over GF(2n ), for even n ≤ 12. The ways how to reduce the number of polynomials from each family are studied. For functions of the form x3 + a-1 tr1(a3 x9 ) it is shown, that they cannot be CCZ-equivalent to a permutation on fields GF(24n ) for n ∈ ℕ .

Interested in being notified about new results for this query?
Subscribe to the RSS feed.